全文获取类型
收费全文 | 475篇 |
免费 | 10篇 |
出版年
2021年 | 6篇 |
2019年 | 17篇 |
2018年 | 10篇 |
2017年 | 16篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 3篇 |
2013年 | 90篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1986年 | 9篇 |
1985年 | 13篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 10篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 16篇 |
1970年 | 3篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 3篇 |
1948年 | 2篇 |
排序方式: 共有485条查询结果,搜索用时 656 毫秒
101.
102.
Properties of a finite-range failure-time distribution, that includes the exponential as a particular case, have been studied. The distribution is IFR when the shape parameter exceeds unity, but is IFRA always. For a given value of the shape parameter, the distribution is NBUE over a segment of its range. Estimators of parameters have been derived. Distributions of two-component series, parallel, and standby system lives have also been worked out. 相似文献
103.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods. 相似文献
104.
A unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and xi ? 0, integer; where vi, wi and W are known integers, and wi (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi-dimensional case, are also considered. 相似文献
105.
Exact first and second order moments of order statistics from the truncated exponential distribution
Exact expressions for the first and second order moments of order statistics from the truncated exponential distribution, when the proportion 1–P of truncation is known in advance, are presented in this paper. Tables of expected values and variances-covariances are given for P = 0.5 (0.1) 0.9 and n = 1 (1) 10. 相似文献
106.
Bol has discussed consequences of the continuity of production correspondences in connection with relations between efficient input and output vectors. Isoquants of continuous production correspondences are used here to extend this work. Simplifications to existing theory are discussed. 相似文献
107.
Using Mills Differential a game value function ?, used in the Kemeny-Morgenstern-Thompson growth model to show the existence of solutions, is discussed. In doing so, several proofs become shorter, in addition known results are seen in a new context. Finally connections between the existence of a so-called economic solution and the differentiability or non-differentiability of function ? are analyzed. 相似文献
108.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
109.
Basil A. Kalymon 《海军后勤学研究》1973,20(1):1-11
Structured finite action-finite state space discounted Markovian decision problems are analyzed. Any problem of a general class is shown to be equivalent to a “separated” problem with decomposable problem structure. A modified policy iteration approach is developed for this decomposable reformulation. Both analytic and computer evaluations of the decomposition algorithm's effectiveness are presented. 相似文献
110.
Many optimization problems occur in both theory and practice when one has to optimize an objective function while an infinite number of constraints must be satisfied. The aim of this paper in to describe methods of handling such problems numerically in an effective manner. We also indicate a number of applications. 相似文献